منابع مشابه
Disjunctive Unification
This paper describes techniques for the representation and efficient unification of feature structures in the presence of disjunctive information. For the specification of feature structures we introduce feature terms which may contain sorts, variables, negation and named disjunction. Disjunction names allow for a compact representation and efficient management of multiple solutions even in cas...
متن کاملDisjunctive Programming
In April 1967 I and my family arrived into the US as fresh immigrants from behind the Iron Curtain. After a fruitful semester spent with George Dantzig’s group in Stanford, I started working at CMU. My debut in integer programming and entry ticket into Academia was the additive algorithm for 0-1 programming [B65], an implicit enumeration procedure based on logical tests akin to what today goes ...
متن کاملDisjunctive Explanations
Abductive logic programming has been widely used to declaratively specify a variety of problems in AI including updates in data and knowledge bases, belief revision, diagnosis, causal theory, and default reasoning. One of the most signi cant issues in abductive logic programming is to develop a reasonable method for knowledge assimilation, which incorporates obtained explanations into the curre...
متن کاملAn Extended Generalized Disjunctive Paraconsistent Data Model for Disjunctive Information
This paper presents an extension of generalized disjunctive paraconsistent relational data model in which pure disjunctive positive and negative information as well as mixed disjunctive positive and negative information can be represented explicitly and manipulated. We consider explicit mixed disjunctive information in the context of disjunctive databases as there is an interesting interplay be...
متن کاملReducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
It is wellknown that Minker’s semantics GCWA for positive disjunctive programs P is ΠP2 -complete , i.e. to decide if a literal is true in all minimal models of P . This is in contrast to the same entailment problem for semantics of non-disjunctive programs such as STABLE and SUPPORTED (both are co-NP-complete) as well as Msupp P and WFS (that are even polynomial). Recently, the idea of reducin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linguistic Inquiry
سال: 2010
ISSN: 0024-3892,1530-9150
DOI: 10.1162/ling.2010.41.1.149